anonym fuzzi ident dbase encrypt similar search distribut techniqu dynam oper placement wireless sensor network oblivi transfer access control realiz disjunct duplic durabl top dk search document archiv optim match spatial dataset capac constraint dhomogen gener privaci preserv data publish optim match spatial dataset capac constraint scalabl probabilist similar rank uncertain databas abstract paper introduc scalabl approach probabilist top similar rank uncertain vector data uncertain object repres set vector instanc assum mutual exclus object rank uncertain data distanc refer object propos framework increment comput object instanc rank posit probabl object fall rank posit result rank probabl distribut serv input state art probabilist rank model exist approach comput probabl distribut appli poisson binomi recurr techniqu quadrat complex paper theoret experiment show framework reduc linear time complex memori requir facilit increment access uncertain vector instanc increas order distanc refer object show output method appli probabilist top rank object state art definit conduct experiment evalu synthet real data demonstr effici approach effici skylin evalu partial order domain consider bodi work skylin evalu multidimension data total order attribut domain method attribut partial order domain exist work map partial order domain total order adapt algorithm totallyord domain solv problem method stronger notion domin gener fals posit requir expens domin check paper propos method drawback method map partial order total order inspir lattic theorem shelf skylin algorithm techniqu storag index approach inspir column store enabl effici verif pair object incompat demonstr method order magnitud effici previou work scale problem paramet complex partial order interest dphrase mine ad dhoc text analyt larg text corpora new custom mail report web contribut offer great potenti enhanc busi intellig applic propos framework perform text analyt data versatil effici scalabl manner prior literatur emphas mine keyword tag blog social tag commun emphas analysi interest phrase includ name entiti import quotat market slogan multi word phrase promin dynam deriv ad hoc subset corpu frequent subset infrequ corpu develop preprocess index method phrase pair search techniqu top interest phrase ad hoc subset corpu framework evalu larg scale real world corpu york time new articl continu spatial assign move user larg set wireless access point own compani scatter citi access point coverag region area transmit receiv data capac maximum number user serv compani maintain central coordin assign user access point subject coverag capac constraint offer highest qualiti servic signal strength compani wish minim averag distanc user assign access point instanc studi problem oper research term optim assign exist solut static case user locat fix method dynam set paper continu assign problem cap optim assign constantli maintain mobil user set server access point fact user mobil necessit real time reassign qualiti servic remain high larg scale time critic natur target applic requir fast cap solut propos algorithm util geometr characterist problem significantli acceler initi assign comput subsequ mainten method appli cost function averag squar distanc minkowski distanc metric euclidean norm advanc spatial tempor databas present theori motion topolog point view symbol perspect take space time histori object primit entiti introduc tempor topolog relat defin space time character class spatial theori account qualit spatial inform deal underspecifi symbol inform accur data unnecessari show structur give basi commonsens spatio tempor reason present number signific deduct theori serv formal basi languag describ motion event qualit xml data integr fragment join abstract studi problem answer xml queri multipl data sourc schema independ scenario xml schema schema map unavail develop fragment join oper gener oper merg xml fragment base overlap compon formal defin oper propos effici algorithm implement defin schema independ queri process multipl data sourc propos framework solv problem provid theoret analysi experiment result show approach effect effici effici evalu multipl prefer queri threshold rang aggreg sensor network abstract recent advanc wireless sensor technolog mica telo mote enabl econom deploy lightweight sensor captur data surround environ serv monitor task forest wildfir alarm volcano activ propos queri call threshold rang aggreg queri tra retriev id sensor averag measur neighborhood exce user threshold queri result robust individu sensor abnorm precis summar sensor statu local region order process snapshot tra queri develop energi effici protocol base oper filter sensor node design oper filter trivial due fact sensor measur influenc actual result node neighborhood region extend protocol continu evalu tra queri experiment result show propos solut offer substanti energi save real synthet sensor network oper placement snapshot multi dpredic queri wireless sensor network abstract work aim minim cost answer snapshot multi predic queri high commun cost network high commun cost hcc network famili network commun data demand resourc wireless sensor network transmit data drain batteri life sensor involv import class multi predic queri horizont vertic distribut databas address show minim commun cost multi predic queri np hard propos dynam program algorithm comput optim solut small problem instanc propos low complex approxim heurist algorithm solv larger problem instanc effici run node low comput power sensor final present variant fermat point problem distanc point minim path weight graph propos solut extens experiment evalu compar proposedalgorithm tothebest knowntechniqueusedtoevalu queri wireless sensor network show improv low complex heurist algorithm shown scalabl robust queri characterist network size scalabl skylin comput object dbase space partit skylin oper return set multi dimension object subset superior object domin oper consid import multi object analysi larg dataset larg number skylin method propos major focus minim cost high dimension space problem easili cpu bound due larg number comput requir compar object current skylin point scan databas base observ propos dynam index techniqu skylin point integr state art sort base skylin algorithm boost comput perform index domin check approach support theoret analysi experi show scale input size dimension unnecessari domin check avoid effici domin check bitwis oper spatial join spatio dtempor data mine signific except current applic data mine area accept discoveri methodolog knowledg discoveri process expect authorit result find discov rule contrast applic field applic spatial spatio tempor discoveri possess tempor data mine find pattern histor data import problem domain paper concentr problem estim futur sale product past sale data recurr neural network tool predict futur sale power gener trend abil store relev inform past sale describ implement distribut recurr neural network real time recurr learn algorithm describ valid implement provid result test exampl literatur descript analysi predict made real world data present explan limit base predict noisi mathemat function appear profit work paper profit profit research initi sloan school manag massachusett institut technolog cambrid framework effici data anonym privaci accuraci constraint recent research studi problem publish microdata reveal sensit inform lead privaci preserv paradigm anonym divers anonym protect identif individu record divers addit safeguard associ individu specif sensit inform exist approach suffer drawback diversif solv techniqu develop simpler anonym problem caus unnecessari inform loss ii anonym process ineffici term comput cost iii previou research focus exclus privaci constrain problem equal import accuraci constrain dual anonym problem articl propos framework effici anonym microdata address defici focu dimension singl attribut quasi identifi studi properti optim solut anonym divers model privaci constrain direct accuraci constrain dual anonym problem guid properti develop effici heurist solv dimension problem linear time final gener solut multidimension quasi identifi space map techniqu extens experiment evalu show techniqu outperform exist approach term execut time inform loss scalabl probabilist similar rank uncertain databas technic report retriev spatial join pattern instanc sensor network effici evalu probabilist advanc spatial queri existenti uncertain data abstract studi problem answer spatial queri databas object exist uncertainti existenti probabl goal threshold probabilist spatial queri retriev object qualifi spatial predic probabl exce threshold rank probabilist spatial queri select object highest probabl qualifi spatial predic propos adapt spatial access method search algorithm probabilist version rang queri nearest neighbor spatial skylin revers nearest neighbor conduct extens experiment studi evalu effect propos solut index term queri process spatial databas audit environ outsourc frequent itemset mine find frequent itemset costli task associ rule mine outsourc task servic provid bring benefit data owner cost relief commit storag comput resourc mine result corrupt servic provid honest make mistak mine process ii lazi reduc costli comput return incomplet result iii malici contamin mine result address integr issu outsourc process data owner verifi correct mine result purpos propos develop audit environ consist databas transform method result verif method main compon audit environ artifici itemset plant aip techniqu provid theoret foundat techniqu prove appropri show probabilist guarante correct verif process analyt experiment studi show techniqu effect effici fair assign algorithm multipl prefer queri internship assign system end academ year interest univers student search appli posit base prefer natur job salari offic locat varieti facil task posit assign context user person prefer express weight attribut search object individu prefer queri evalu select object databas highest aggreg score case multipl simultan request singl object assign user challeng comput fair match queri object model stabl marriag problem propos effici method process algorithm iter find stabl queri object pair remov problem core li skylin mainten techniqu prove optim conduct extens experiment evalu real synthet data demonstr approach outperform adapt previou method order magnitud audit environ outsourc frequent itemset mine find frequent itemset costli task associ rule mine outsourc task servic provid bring benefit data owner cost relief commit storag comput resourc mine result corrupt servic provid honest make mistak mine process ii lazi reduc costli comput return incomplet result iii malici contamin mine result address integr issu outsourc process data owner verifi correct mine result purpos propos develop audit environ consist databas transform method result verif method main compon audit environ artifici itemset plant aip techniqu provid theoret foundat techniqu prove appropri show probabilist guarante correct verif process analyt experiment studi show techniqu effect effici multi ddimension top dk domin queri abstract top domin queri return data object domin highest number object dataset queri import tool decis support data analyst intuit find signific object addit combin advantag top skylin queri share disadvantag output size control ii rank function user iii result independ scale dimens import top domin queri receiv adequ attent research commun paper extens studi evalu topk domin queri propos set algorithm appli index multi dimension data investig queri evalu data index final studi relax variant queri consid domin dimension subspac experi synthet real dataset demonstr algorithm significantli outperform previou skylin base approach illustr applic multi dimension analysi queri studi meaning result real data scientif statist databas manag abstract resourc descript framework rdf format larg number scientif applic store dissemin dataset proven inform describ sourc lineag dataset plai increasingli signific role ensur data qualiti comput trust dataset rank queri result current proven track approach rdf reific vocabulari suffer number issu includ lack formal semant blank node applic depend interpret reifi rdf tripl paper introduc approach call proven context entiti pace notion proven context creat proven awar rdf tripl defin formal semant pace simpl extens exist rdf semant ensur compat pace exist semant web tool implement implement pace approach biomed knowledg repositori bkr project nation librari medicin evalu demonstr minimum reduct total number proven specif rdf tripl gener pace approach compar rdf reific addit perform complex queri improv order magnitud remain compar rdf reific approach simpler proven queri ring dconstrain join deriv fair middleman locat pointset geometr constraint introduc spatial join oper ring constrain join rcj set spatial point result rcj consist pair satisfi intuit geometr constraint smallest circl enclos point oper import applic decis support place recycl station fair locat restaur residenti complex rcj defin base geometr constraint distanc point oper fundament convent distanc join closest pair problem awar effici process algorithm rcj literatur brute forc solut requir comput cost quadrat input size scale larg dataset view develop effici tree base algorithm comput rcj exploit characterist geometr constraint evalu experiment effici method synthet real spatial dataset result show propos algorithm scale data size robust perform data distribut common influenc join natur join oper spatial pointset abstract identifi formal join oper spatial pointset common influenc join cij return pair point exist locat space closer point time closer point contrast exist join oper pointset distanc join closest pair cij parameterfre provid natur join result find applic market decis support propos algorithm effici evalu cij pointset index hierarch multi dimension index valid effect effici method experiment synthet real spatial dataset experiment result show block algorithm comput intersect pair voronoi cell demand effici practic incur slightli higher cost theoret lower bound cost problem lattic histogram resili synopsi structur abstract surg interest data reduct techniqu past year method propos date achiev approxim qualiti prefer optim plain histogram target error metric paper introduc lattic histogram data reduct method discov exploit arbitrari hierarchi data achiev approxim qualiti provabl high optim histogram data reduct problem formul lh construct techniqu approxim guarante gener error metric show case minim maximum error metric solv special memori spare approach exploit solut design reduc space heurist generalerror case develop mix synopsi approach applic space effici high qualiti summar larg data set experiment corrobor superior lh approxim qualiti previou techniqu repres error metric divers data set privaci preserv public trajectori capac constrain assign spatial databas dlocat pattern algorithm top dk olap queri augment spatial access method index bdual tree nearest neighbor queri network databas frequent type queri spatial network road network find nearest neighbor knn queri object dlocat pattern hierarch synops optim error guarante extract import group data effici studi import data analysi oper extract import group data group highest aggreg valu data wareh context queri find combin product type month largest sum sale problem challeng potenti number group larger memori capac propos demand method effici top group process limit memori size design top group retriev techniqu repres scenario scenario data physic order measur propos write optim multi pass sort access algorithm wmsa exploit memori effici top group comput scenario unord data develop recurs hash algorithm rha appli hash earli aggreg coupl branch bound techniqu deriv heurist tight score bound hash partit design cluster group algorithm cga acceler top group process case data cluster subset group attribut extens experi real synthet dataset demonstr applic effici propos algorithm privaci dpreserv anonym set dvalu data paper studi problem protect privaci public set valu data collect transact data detail inform item bought individu remov person characterist buyer serv link ident public data subject privaci attack adversari partial knowledg set unlik previou work distinguish data sensit sensit potenti quasi identifi potenti sensit data depend point view adversari defin version anonym guarante anonym limit effect data dimension propos effici algorithm transform databas anonym model reli gener suppress common practic relat work data develop algorithm find optim solut high cost make inapplic larg realist problem propos greedi heurist scale case find solut close optim propos algorithm experiment evalu real dataset comput monitor exclus closest pair abstract dataset exclus closest pair ecp join assign object dataset closest pair result ii remain pair determin remov object recurs search closest pair real applic exclus closest pair comput car park slot assign paper introduc problem propos solut solv mainmemori exploit space partit addit defin dynam version problem object continu monitor ecp join solut environ join dataset chang posit content final studi extend form queri object join set park slot capac constraint allow match multipl object set car show techniqu extend variant compar previou solut problem experiment result system prototyp demonstr effici applic propos algorithm privaci dpreserv anonym set dvalu data paper studi problem protect privaci public set valu data collect transact data detail inform item bought individu remov person characterist buyer serv link ident public data subject privaci attack adversari partial knowledg set unlik previou work distinguish data sensit sensit potenti quasi identifi potenti sensit data depend point view adversari defin version anonym guarante anonym limit effect data dimension propos effici algorithm transform databas anonym model reli gener suppress common practic relat work data develop algorithm find optim solut high cost make inapplic larg realist problem propos greedi heurist scale case find solut close optim propos algorithm experiment evalu real dataset top dk spatial prefer queri spatial prefer queri rank object base qualiti featur spatial neighborhood real estat agenc offic hold databas flat leas custom rank flat respect appropri locat defin aggreg qualiti featur restaur cafe hospit market distanc rang paper formal defin spatial prefer queri propos index techniqu search algorithm method experiment evalu wide rang problem set haar tree refin synopsi data structur exploit dualiti summar determinist guarante summar import task data mine major challeng past year effici construct fix space synops provid determinist qualiti guarante express term maximum error metric histogram hierarch techniqu propos problem time space complex remain impract high depend data set size space budget handicap stem requir tabul alloc synopsi space region data paper develop altern methodolog dispel defici fruit applic solut dual problem maximum allow error determin minimum space synopsi achiev compar state art histogram construct algorithm reduc time complex log log factor hierarch synopsi algorithm reduc complex log factor log log time log log space optim error complex advantag offer spaceeffici scalabl previou approach lack verifi benefit approach practic experiment retriev spatial join pattern instanc sensor network continu monitor exclus closest pair dataset exclus closest pair ecp join assign object dataset closest pair result ii remain pair determin remov object recurs search closest pair applic exclus closest pair comput car park slot assign paper propos algorithm comput continu monitor ecp join memori stream event dynam assign request releas pair experiment result system prototyp demonstr effici solut practic continu constraint queri evalu spatiotempor stream abstract paper studi evalu continu constraint queri ccq spatiotempor stream ccq trigger alert configur constraint stream event space time satisfi instanc server receiv updat gp enabl agent report posit measur environment read ccq alert read closer km time differ minut report high pressur low temperatur model ccq constraint satisfact problem csp develop solut continu evalu techniqu fast arriv rate incom event minim memori requir predefin window constraint util structur queri order show merit propos techniqu implement system prototyp evalu real data secur outsourc associ rule mine effici process top dk domin queri multi ddimension data top domin queri return data object domin highest number object dataset queri import tool decis support data analyst intuit find signific object addit combin advantag top skylin queri share disadvantag output size control ii rank function user iii result independ scale dimens import top domin queri receiv adequ attent research commun paper design special algorithm appli index multi dimension data fulli exploit characterist problem experi synthet dataset demonstr algorithm significantli outperform previou skylin base approach result real dataset show meaning top domin queri effici top dk aggreg rank input top queri combin rank set object return object highest combin score aggreg function bring light kei observ impos phase top algorithm base sort access base propos algorithm design minim number object access comput cost memori requir top search monoton aggreg function provid analysi cost show wors baselin random access algorithm term comput access memori requir side contribut perform space analysi memori requir top algorithm perform sort access case requir space exce memori propos disk base variant algorithm propos optim multiwai top join oper advantag evalu tree binari top join oper final defin studi comput top cube implement roll drill oper cube extens experi synthet real data show compar previou techniqu method access fewer object order magnitud faster fast data anonym low inform loss recent research studi problem publish microdata reveal sensit inform lead privaci preserv paradigm anonym divers anonym protect identif individu record divers addit safeguard associ individu specif sensit inform exist approach suffer drawback inform loss metric counter intuit fail captur data inaccuraci inflict sake privaci ii divers solv techniqu develop simpler anonym problem introduc unnecessari inaccuraci iii anonym process ineffici term comput cost paper propos framework effici privaci preserv address defici focu dimension singl attribut quasiidentifi studi properti optim solut anonym divers base meaning inform loss metric guid properti develop effici heurist solv dimension problem linear time final gener solut multi dimension quasi identifi space map techniqu extens experiment evalu show techniqu outperform state art term execut time inform loss effici top dk aggreg rank input top queri combin rank set object return object highest combin score aggreg function bring light kei observ impos phase top algorithm base sort access base propos algorithm design minim number object access comput cost memori requir top search monoton aggreg function provid analysi cost show wors baselin random access algorithm term comput access memori requir side contribut perform space analysi memori requir top algorithm perform sort access case requir space exce memori propos disk base variant algorithm propos optim multiwai top join oper advantag evalu tree binari top join oper final defin studi comput top cube implement roll drill oper cube extens experi synthet real data show compar previou techniqu method access fewer object order magnitud faster revers nearest neighbor search ad hoc subspac object model multidimension point revers nearest neighbor rnn queri return set object databas nearest neighbor paper studi interest gener rnn queri dimens consid ad hoc subset thereof rational dimension high result regular rnn queri ii miss valu implicitli defin meaning subspac rnn retriev iii analyst interest queri result set ad hoc problem dimens object attribut suitabl storag scheme develop algorithm project rnn queri reli multidimension index method experiment evalu real synthet data discoveri period pattern spatiotempor sequenc applic track analyz spatiotempor data movement obei period pattern object follow rout approxim regular time interv peopl wake time follow rout work everydai discoveri hidden period pattern spatiotempor data provid unveil import inform data analyst exist approach discov period pattern focu symbol sequenc method directli appli spatiotempor sequenc fuzzi spatial locat sequenc paper defin problem mine period pattern spatiotempor data propos effect effici algorithm retriev maxim period pattern addit studi interest variant problem retriev period pattern frequent histori continu subinterv problem discoveri period pattern instanc shift distort demonstr mine techniqu adapt variant final present comprehens experiment evalu show effect effici propos techniqu effici quantil retriev multi ddimension data abstract set multi dimension point studi comput quantil rank function provid user runtim specif comput score base coordin point object report object score smallest dataset quantil provid succinct summari distribut underli data onlin decis support data mine select estim queri optim assum dataset index spatial access method propos algorithm retriev quantil effici analyt experiment result demonstr branch bound method highli effect practic outperform altern approach signific factor effici aggreg rank input top queri combin rank set object return object highest combin score aggreg function bring light kei observ impos phase top algorithm base sort access base propos algorithm design minim number object access comput cost memori requir top search adapt algorithm search variant exact score line increment search top join aggreg function provid extens experi synthet real data show compar previou techniqu method access fewer object order magnitud faster revers nearest neighbor search ad dhoc subspac object model multidimension point revers nearest neighbor rnn queri return set object databas nearest neighbor paper studi interest gener rnn queri dimens consid ad hoc subset thereof rational dimension high result regular rnn queri ii miss valu implicitli defin meaning subspac rnn retriev iii analyst interest queri result set ad hoc problem dimens object attribut suitabl storag scheme develop algorithm project rnn queri reli multidimension index method experiment evalu real synthet data discoveri colloc episod spatiotempor data ad dhoc distribut spatial join mobil devic pda cellular phone mobil devic capabl support complex data manipul oper focu ad hoc spatial join dataset resid multipl cooper server assum mediat spatial join evalu mobil devic contrari common applic cost server side main issu minim transfer data meet resourc constraint devic show exist method base partit prune inadequ realist situat present algorithm estim data distribut decid physic oper independ partit experi prototyp implement wifi enabl pda suggest propos method outperform competitor term effici applic detect direct motion binari sensor network examin problem detect direct motion binari sensor network network sensor suppli reliabl singl bit inform move object approach move sensor demonstr geometr properti network exploit detect movement direct singl instanc sensor read estim perform distribut process fashion minim data collect situat depend lead sensor featur low comput burden sensor addit detect instanc drain resourc group sensor small size compar size network experi demonstr high accuraci increas sensor densiti sens rang respons detect model practic instantan continu nearest neighbor monitor road network recent research focus continu monitor nearest neighbor nn highli dynam scenario queri data object move frequent arbitrarili exist method assum euclidean distanc metric paper studi nn monitor road network distanc queri data object determin length shortest path connect propos method handl arbitrari object queri move pattern fluctuat edg weight maintain queri result process updat invalid current nn set method share execut paradigm reduc process time group queri fall path consecut intersect network produc result monitor nn set intersect experiment verifi applic propos techniqu continu monitor larg data queri set revers nearest neighbor larg graph abstract revers nearest neighbor rnn queri return data object queri point nearest neighbor nn queri studi extens euclidean space previou work context larg graph paper provid fundament lemma prune search space travers graph search rnn base develop rnn method eager algorithm attempt prune network node visit lazi techniqu prune search space data point discov studi retriev arbitrari number revers nearest neighbor investig benefit materi cover queri type deal case queri data object resid node edg graph propos techniqu evalu practic scenario involv spatial map comput network dblp coauthorship graph index term queri process spatial databas graph network revers nearest neighbor search metric space abstract set object revers nearest neighbor rnn queri return object closer queri object object similar metric exist rnn solut suffici reli precomput inform expens maintain presenc updat applic data consist euclidean object similar measur norm paper present algorithm effici rnn search gener metric space techniqu requir detail represent object appli long mutual distanc comput distanc metric satisfi triangl inequ confirm effect propos method extens experi index term revers nearest neighbor metric space revers nearest neighbor larg graph abstract revers nearest neighbor rnn queri return data object queri point nearest neighbor nn queri studi extens euclidean space previou work context larg graph paper provid fundament lemma prune search space travers graph search rnn base develop rnn method eager algorithm attempt prune network node visit lazi techniqu prune search space data point discov studi retriev arbitrari number revers nearest neighbor investig benefit materi cover queri type deal case queri data object resid node edg graph propos techniqu evalu practic scenario involv spatial map comput network dblp coauthorship graph index term queri process spatial databas graph network mine frequent spatio dtempor sequenti pattern applic track movement mobil object repres sequenc timestamp locat spatio tempor seri studi problem discov sequenti pattern rout frequent object sequenti pattern mine algorithm transact data directli applic set challeng address fuzzi locat pattern ii identif explicit pattern instanc paper defin pattern element spatial region frequent line segment method transform origin sequenc list sequenc segment detect frequent region heurist propos algorithm find pattern emploi newli propos substr tree structur improv apriori techniqu perform evalu demonstr effect effici approach rpj produc fast join result stream rate dbase optim evalu top dk olap queri aggreg dtree abstract top olap queri group measur respect abstract level interest dimens select group highest aggreg queri find combin product type month largest sum sale queri appli spatial databas context object augment measur aggreg spatial divis instanc map object restaur object carri nonspati measur number custom serv month partit space region regular grid goal find region highest number serv custom straightforward method evalu top olap queri comput aggreg group select group highest aggreg paper studi integr top oper aggreg queri process modul make spatial index augment aggreg inform aggreg tree devic branch bound algorithm access minim number tree node order comput top group effici approach demonstr experiment discov move cluster spatio dtempor data abstract move cluster defin set object move close long time interv real life exampl group migrat anim convoi car move citi studi discoveri move cluster databas object trajectori differ problem compar cluster trajectori mine movement pattern ident move cluster remain unchang locat content chang time group anim migrat anim leav group anim enter provid formal definit move cluster describ algorithm automat discoveri straight forward method base definit ii effici method avoid redund check iii approxim algorithm trade accuraci speed borrow idea mpeg video encod experiment result demonstr effici techniqu applic larg spatio tempor dataset probabilist spatial queri existenti uncertain data abstract studi problem answer spatial queri databas object exist uncertainti existenti probabl goal threshold probabilist spatial queri retriev object qualifi spatial predic probabl exce threshold rank probabilist spatial queri select object highest probabl qualifi spatial predic propos adapt spatial access method search algorithm probabilist version rang queri nearest neighbor conduct extens experiment studi evalu effect propos solut dpass wavelet synops maximum derror metric studi problem comput waveletbas synops massiv data set static stream environ compact represent data set obtain threshold process appli coeffici wavelet decomposit exist polynomi time threshold scheme minim maximum error metric disadvantag impractic time space complex applic data stream context cardin issu problem hand practic interest form involv time effici approxim huge amount data potenti stream environ paper fill gap develop effici practic wavelet threshold algorithm maximum error metric static stream case algorithm achiev optim accuraci superior runtim perform experi show frugal space requir context spatial join algorithm cost model optim techniqu iter project cluster subspac mine abstract irrelev attribut add nois high dimension cluster render tradit cluster techniqu inappropri recent algorithm discov project cluster subspac propos paper realiz analog mine frequent itemset discov dens project cluster random point base propos techniqu improv effici project cluster algorithm doc method optim adapt frequent pattern tree growth method mine frequent itemset propos techniqu emploi branch bound paradigm effici discov project cluster experiment studi synthet real data demonstr techniqu significantli improv accuraci speed previou techniqu index term databas manag databas applic cluster classif associ rule aggreg nearest neighbor queri road network abstract aggreg nearest neighbor queri return object minim aggreg distanc function respect set queri point user specif locat queri point find restaur data point lead minimum sum distanc travel order meet studi process queri case posit access spatial object constrain spatial road network altern aggreg function techniqu util euclidean distanc bound spatial access method network distanc materi structur algorithm experiment evalu synthet real data result show rel perform depend problem characterist index term queri process spatial databas spatial databas gi locat depend sensit index structur pattern xml queri process abstract queri semistructur data hard process due complex natur data call special techniqu exist path base index queri process algorithm effici search complex structur simpl path queri high select introduc definit minim infrequ structur mi structur exist data frequent respect support threshold substructur frequent index occurr mi effici locat high select substructur queri improv search perform significantli effici data mine algorithm propos find minim infrequ structur occurr xml data index lightweight data structur fast filter step queri evalu valid effici applic method experiment synthet real data index term queri process xml xsl rdf mine method algorithm document index fast exact warp time seri adapt segment approxim abstract similar search core modul data analysi task includ search classif cluster time seri data dynam time warp dtw proven effect similar measur minim effect shift distort time quadrat cost dtw comput length match sequenc make direct applic databas long time seri expens propos techniqu decompos sequenc number segment cheap approxim thereof comput fast lower bound warp distanc present progress tighter bound reli exist warp constraint final develop index multi step techniqu propos bound perform level filter effici process similar queri experiment studi suggest method consist outperform state art method dtw similar search constraint satisfact semi dstructur data graph abstract xml data model node label graph xml queri express structur relationship label element xml queri evalu address databas case graph search techniqu propos altern method model solv queri constraint satisfact problem csp describ common constraint type occur xml queri show queri evalu benefit method preprocess solv csp identifi import binari constraint common modul xml queri describ gener arc consist algorithm low cost ensur polynomi queri evalu final demonstr maintain consist binari constraint greatli acceler search intract queri includ referenti relationship algorithm quantifi constraint satisfact problem abstract propag search algorithm develop constraint satisfact problem csp standard csp variabl existenti quantifi csp formal extend univers quantifi variabl case complex basic reason task rise np complet pspace complet problem studi context quantifi boolean formula work problem discret boolean domain attempt fill gap extend propag search algorithm standard csp quantifi case show notion interchang exploit break symmetri speed search order magnitud final test experiment algorithm method propos process ad dhoc join mobil devic abstract mobil devic capabl retriev process data remot databas wireless data transmiss environ user typic charg size transfer data amount time stai connect propos algorithm join inform collabor remot databas mobil devic method minim data transfer join process limit mobil devic experiment result show approach perform join process mobil devic effect dcontigu sequenc pattern queri abstract contigu subsequ pattern queri search symbol instanc long sequenc satisfi soft tempor constraint paper propos methodolog index long sequenc order effici process queri sequenc data decompos tabl queri evalu multiwai join describ block join oper provid queri preprocess optim techniqu tighten join predic suggest good join order plan oppos previou approach method effici handl broader rang queri easili support exist dbm effici evalu experiment synthet real data mine index queri histor spatiotempor data abstract larg spatio tempor databas event event consist field event id time locat event type mine spatio tempor sequenti pattern identifi signific event type sequenc spatio tempor sequenti pattern crucial investig spatial tempor evolut phenomena applic domain recent research literatur explor sequenti pattern transact data trajectori analysi move object method directli appli mine sequenti pattern larg number spatio tempor event major research challeng remain definit signific measur spatio tempor sequenti pattern avoid spuriou algorithm design signific measur guarante downward closur properti paper propos sequenc index signific measur spatio tempor sequenti pattern meaning due interpret spatial statist propos algorithm call slice st miner tackl algorithm design challeng spatial sequenc index preserv downward closur properti compar propos algorithm simpl algorithm call st miner util weak monoton properti sequenc index perform evalu synthet real world data set show slice st miner order magnitud faster st miner larg data set index term spatio tempor sequenti pattern densiti ratio sequenc index slice perform fast mine spatial colloc cluster object spatial network discov partial period pattern discret data sequenc abstract problem partial period pattern mine discret data sequenc find subsequ period frequent data sequenc essenti subproblem effici mine frequent pattern automat discoveri period correspond pattern previou method problem event sequenc databas assum period advanc requir addit databas scan comput period defin candid pattern work propos structur abbrevi list tabl alt effici algorithm comput period pattern requir small number pass perform studi present demonstr effect effici method cluster object spatial network dnearest dneighbor queri spatial databas set multidimension object nearest neighbor ann queri retriev object nearest neighbor oper common applic receiv attent databas literatur paper studi altern method process ann queri depend index algorithm evalu extens experiment synthet real dataset perform studi show order magnitud faster previou approach base closest pair queri process discov minim infrequ structur xml document complex spatial queri process effici scalabl algorithm cluster xml document structur abstract standard xml inform exchang languag net huge amount inform format xml document order analyz inform effici decompos xml document store relat tabl popular practic queri process expens case excess number join requir recov inform fragment data collect consist document structur dtd mine cluster document allevi fragment problem propos hierarch algorithm grace cluster xml document base structur inform data notion structur graph graph propos support computation effici distanc metric defin document set document simpl metric yield cluster algorithm effici effect compar approach base tree edit distanc experi real data show algorithm discov cluster easili identifi manual inspect index term data mine cluster xml semistructur data queri process frequent dpattern base iter project cluster abstract irrelev attribut add nois high dimension clustersand make tradit cluster techniqu inappropri project cluster algorithm propos findth cluster hidden subspac realiz analog mine frequent itemset discov relevantsubspac cluster propos methodolog find project cluster mine frequent itemset andpres heurist improv qualiti techniqu evalu synthet real data scalableand discov project cluster accur introduct cluster typic partit collect datasampl set cluster group similar object cluster larg ob ject cluster dissimilar typic applic includ custom segment imag process biologi document classif index effici cost model optim nearest neighbor search low medium dimension space exist model nearest neighbor search multi dimension space queri optim lead erron estim involv complex equat expens evalu real time paper propos altern method captur perform nearest neighbor queri approxim uniform data model involv close formula effici comput accur dimens propos equat appli uniform data aid histogram demonstr effect model solv optim problem relat nearest neighbor search ieee tkde similar search set categor data signatur tree data mine applic analyz larg collect set data high dimension categor data search data type restrict classic problem mine associ rule classif similar search frequent appli oper access method multidimension numer data inappropri problem special index need propos method repres set data bitmap signatur organ hierarch index suitabl similar search relat queri type contrast previou techniqu signatur tree dynam reli hardwir constant experi synthet real dataset show robust data characterist scalabl databas size effici queri frequent dpattern base iter project cluster abstract irrelev attribut add nois high dimension clustersand make tradit cluster techniqu inappropri project cluster algorithm propos findth cluster hidden subspac realiz analog mine frequent itemset discov relevantsubspac cluster propos methodolog find project cluster mine frequent itemset andpres heurist improv qualiti techniqu evalu synthet real data scalableand discov project cluster accur introduct cluster typic partit collect datasampl set cluster group similar object cluster larg ob ject cluster dissimilar typic applic includ custom segment imag process biologi document classif index effici process join set dvalu attribut valid inform retriev spatio dtempor queri theoret perform bound result tradit spatial queri rang search nearest neighbor meaningless spatio tempor applic invalid movement queri data object practic queri result accompani valid inform futur time expir ii chang time updat increment algorithm propos problem worst case perform sequenti scan paper present theoret studi valid queri develop index algorithm attract complex optim spatial join mobil devic evalu iceberg distanc join queri process spatial network databas import spatial network real life applic spatial databas literatur focus euclidean space paper propos architectur integr network euclidean inform captur pragmat constraint base architectur develop euclidean restrict network expans framework advantag locat connect effici prune search space framework successfulli appli popular spatial queri nearest neighbor rang search closest pair edist join context spatial network databas filter index complex queri semi dstructur data slot index spatial join abstract effici process spatial join import due high cost frequent applic spatial databas area involv multidimension data paper propos slot index spatial join sisj algorithm join nonindex data set index tree explor optim techniqu reduc space requir comput cost sisj compar analyt experiment spatial join method case nonindex input read disk intermedi result preced databas oper complex queri plan import buffer split consecut join oper demonstr join case studi method estim optim split propos evalu show sisj outperform altern method case suitabl limit memori condit index term spatial databas queri process join process databas index spatial index buffer manag effici dnn search vertic decompos data applic multimedia retriev requir cient support similar search larg data collect nearest neighbor search di cult problem high dimension space render cient applic hard realiz index structur degrad rapidli increas dimension sequenti search attract solut repositori million object paper approach problem di erent angl solut sought unconvent storag scheme open rang techniqu process nn queri suit high dimension space suggest physic databas design accommod variant branch bound search reduc high dimension space quickli small candid set paper insight appli idea nn search similar metric commonli encount imag databas applic discuss techniqu implement relat databas system ectiv propos method evalu empir real synthet data set report signific improv respons time yield view select random search import issu data warehous develop select set view materi order acceler olap queri space mainten time constraint exist method provid good result high execut cost limit applic larg problem paper explor applic random local search algorithm view select problem effici propos techniqu evalu synthet dataset cover wide rang data queri distribut result show random search method provid optim solut limit time robust data queri skew easili adapt version problem includ simultan exist size time constraint view select dynam environ propos heurist scale problem size real life warehous analyz numer busi perspect index retriev histor aggreg inform move object spatio tempor databas store inform posit individu object time applic traffic supervis mobil commun system summar data averag number car area specif period phone servic cell dai requir inform obtain oper databas comput expens render onlin process inapplic vital solut construct spatiotempor data warehous paper describ framework support olap oper spatiotempor data argu spatial tempor dimens model combin dimens data cube present data structur integr spatiotempor index pre aggreg materi techniqu requir priori knowledg group hierarchi develop method util propos structur effici execut ad hoc group by techniqu static dynam dimens solv dbinari csp hidden variabl encod binari constraint satisfactionproblfa csp sol ed di erent wai eithertranslzfi theproblh equivali binari sol wele vo fir ol binari csp techniqu extend version binari techniqu directl binaryproblin recentl shown hidden variabl encod promis method oftranslo binari csp binari paper make atheoret andempir investig arc consist searchalxrfio zh hidden variabl encod weanalk potenti benefit ofapplxzz arc consist hidden encod compar togener zfi arc consist binari represent weal show searchalkhro zz nonbinari constraint emulk binaryalryofixh oper hidden variabl encod onl instanti origin variablo empir resulc variousimplsoz tation suchal gorithm reveal hidden variabl competit case binari represent cltain binari constraint select estim complex spatial queri studi focus effici process simpl spatial queri type select spatial join work optim queri process spatial input combin join select condit paper identifi depend spatial oper illustr affect outcom complex queri analysi yield select estim optim combin spatial nonspati select join oper accuraci formula evalu experiment queri addit import spatial databas present result appli domain depend exist oper multiwai spatial join due evolut geograph inform system larg collect spatial data themat content result interest user limit simpl spatial select join complex queri type implic numer spatial input common algorithm propos comput result pairwis spatial join limit work exist process optim multiwai spatial join articl review pairwis spatial join algorithm show combin multipl input addit explor applic synchron travers st methodolog process synchron input produc intermedi result integr approach engin includ st pairwis algorithm dynam program determin optim execut plan result show case multiwai spatial join process combin st pairwis method final studi optim larg queri emploi random search algorithm approxim spatio dtempor retriev paper propos framework handl spatio tempor queri inexact match concept relat similar initi describ binari string encod relat permit automat deriv similar measur extend model granular level dimens show reason spatio tempor structur significantli facilit framework final provid algorithm optim method type queri object retriev base spatio tempor relat respect refer object ii spatial join retriev object pair satisfi input relat iii structur queri retriev configur match spatio tempor structur iv special case motion queri current larg avail multidimension data increas flexibl queri answer mechan techniqu core spatio tempor queri processor constraint dbase process multiwai spatial join multiwai spatial join combin inform found spatial relat respect spatial predic motiv close correspond constraint satisfact problem csp show multiwai spatial join process systemat search algorithm tradition csp paper describ strategi window reduct synchron travers advantag underli spatial index prune search space effect addit provid cost model optim method combin strategi comput effici execut plan final evalu effici propos techniqu accuraci cost model extens experiment queri data combin kei word spatial databas spatial join constraint satisfact tree hierarch constraint satisfact spatial databas improv search index studi tempor csp process optim multiwai spatial join dtree import type queri process spatial databas geograph inform system spatial join oper select relat object pair satisfi spatial predic multiwai join combin data origin relat techniqu propos pairwis spatial join limit work focus multiwai spatial join process paper solv multiwai spatial join appli systemat search algorithm exploit tree effici guid search build temporari index materi intermedi result addit gener methodolog propos cost model optim algorithm evalu extens experiment content dbase retriev heurist search integr spatial join algorithm process multipl input techniqu comput join spatial dataset propos decad method exist indic join input treat dataset index provid solut case input intermedi result databas oper paper analyz previou work spatial join propos algorithm call slot index spatial join sisj effici comput spatial join input index tree step show sisj spatial join algorithm implement oper databas environ join spatial dataset studi differ relat spatial multiwai join propos dynam program algorithm optim execut complex spatial queri keyword spatial join spatial queri process queri optimizati assess multimedia similar framework structur motion paper address issu structur multimedia similar base relat individu object compris multimedia document propos binari string encod relat permit automat deriv similar measur extend resolut level dimens show reason spatiotempor structur significantli facilit framework appli multimedia present motion similar keyword multimedia similar similar queri spatiotempor relat introduct gener theme work develop formal framework express queri multimedia data motiv common recent observ increas avail multimedia document www ii emerg effici navig document repositori multimedia document simpli document constraint dbase algorithm comput cliqu intersect join spatial join constitut activ research topic spatial queri process paper deal process cliqu intersect join tree cliqu intersect join retriev tupl object pair wise overlap mbr base filter step retriev tupl rectangl intersect common point modifi algorithm propos specif problem experiment evalu perform data set densiti keyword spatial join spatial queri process multi join imag similar retriev spatial constraint paper deal queri involv retriev imag object configur instanc user find imag exist build adjac west side park southwest commerci center queri formul constraint satisfact problem csp queri variabl node constraint network imag object constitut domain variabl arc network correspond spatial constraint adjac west southwest problem natur gener intract addit spatial constraint southwest lack univers accept semant model crisp relat fact complic queri process paper focus develop effect method advantag special structur spatial domain achiev good averag perform larg imag queri algorithm queri spatial structur paper propos framework handl spatio tempor queri inexact match concept relat similar initi describ binari string encod relat permit automat deriv similar measur extend model granular level dimens show reason spatio tempor structur significantli facilit framework final provid algorithm optim method type queri object retriev base spatio tempor relat respect refer object ii spatial join retriev object pair satisfi input relat iii structur queri retriev configur match spatio tempor structur iv special case motion queri current larg avail multidimension data increas flexibl queri answer mechan techniqu core spatio tempor queri processor conceptu titl abstract model queri larg interact multimedia repositori 